SIMPLEX TYPE ALGORITHMS GENERATING TWO PATHS TO THE OPTIMAL SOLUTION K. DOSIOS, K. PAPARRIZOS, N. SAMARAS and K. TSIPLIDIS
نویسندگان
چکیده
We present generalizations of simplex type algorithms generating two paths to the optimal solution. A distinguished charcteristic of the algorithm is the fact that one of the paths is not of simplex type. As a result the algorithms, avoiding the movement from one vertex to an adjacent one, can move from one arbitrary boundary point to another.
منابع مشابه
Worst case examples of an exterior point algorithm for the assignment problem
An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51 (1991) 45–54]. This algorithm belongs to the category of forest algorithms and solves an n × n assignment problem in at most n(n−1) 2 iterations and in at most O(n3) time. In thi...
متن کاملA deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm
In a recent primal-dual simplex-type algorithm [K. Paparrizos, N. Samaras and G. Stephanides, 2003, A new efficient primal dual simplex algorithm. Computers & Operations Research 30, 1383–1399], their authors show how to take advantage of the knowledge of a primal feasible point and they work with a square basis during the whole process. In this paper we address what could be thought of as its ...
متن کاملOn the initialization methods of an exterior point algorithm for the assignment problem
In this paper we present a theoretical investigation and an extensive computational study of Exterior Point Simplex Algorithm (EPSA) initialization methods for the Assignment Problem (AP). We describe the exterior point algorithm using three different initialization methods. Effective implementations are explored for each initialization method. Then we perform an experimental evaluation on a la...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملA new network simplex algorithm to reduce consecutive degenerate pivots and prevent stalling
It is well known that in operations research, degeneracy can cause a cycle in a network simplex algorithm which can be prevented by maintaining strong feasible bases in each pivot. Also, in a network consists of n arcs and m nodes, not considering any new conditions on the entering variable, the upper bound of consecutive degenerate pivots is equal $left( begin{array}{c} n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005